搜索资源列表
prime1
- 实现素数的求解方法，利用素数表进行线性时间筛选-Solving the achievement of prime numbers, using prime time table for the linear filter
Prove
- 证明“素数公式”:证明求素数的公式a=b*b+b+41的真假。-Prove " Formula for primes" : prime numbers seeking to prove the formula a = b* b+ b+41 is true or not.
VerifiedGoldbach
- 验证哥德巴赫猜想：任何大于6的偶数，均可以表示为两个奇素数之和。改程序就是验证这一猜想。-Verify Goldbach' s conjecture: any even number greater than 6, can be expressed as the sum of two odd prime numbers. Reform program is to verify this conjecture.
crivello_eratostene
- the Sieve of Eratosthenes,ancient algorithm for finding all prime numbers up to a specified integer
HW2_shah006
- Learn why understanding the embedded systems uC/uP effect Data type and usage. this code in the MPLAB environment as outlined in the procedure. This code finds all prime numbers within a specific range (0-127) without and mathematical algor
shuzijisuan
- //编写程序：要求能够通过控制台窗口接收一个整数n，然后在文件"data.txt"中写入所有比n小的素数 //，最后通过控制台窗口分别显示每个数字（0——9）在这些素数中出现的次数。P218-//Write process: requirements through the console window to receive an integer n, then in the file " data.txt" writes all the prime numbers sma
sushu
- 判断是否是素数，计算一共有几个素数。并求出所有素数的和。-To determine whether a prime number, calculate a total number of primes. And to find all prime numbers and.
buyongkaifangqiuzhishu
- 突然想到不用开方求质数的方法，所以用visual basic实现。-Suddenly thought of seeking prime numbers do not prescribe the method, so using visual basic to achieve.
RSA
- 实现rsa加密解密过程，产生大素数，大素数的加减乘除。-Achieve rsa encryption and decryption process, resulting in large prime numbers, multiplication and division addition and subtraction of large prime numbers.
SIEVE
- 一种叫做SIEVE的算法，比较快的算出2到某个指定数之间的所有质数。-SIEVE algorithm called relatively quickly calculate the 2 to a specified number of all the prime numbers between.
FindPrime
- 找素数，这是个小程序，可以随意找出素数。这个程序也是个教学程序。-To find prime numbers, which is a small program, are free to find prime numbers. This procedure is also a teaching program.
findsushu
- 用筛选法可得到2～10000之间的所有素数，找出此序列中最长的等差序列（连续的和不连续的两种）。例如：3，5，7 为一连续等差序列，长度为3，公差为2；而7，13，19 为一不连续等差序列，长度为3，公差为6。-2 with the screening method available for all prime numbers between 10000 to find out the sequence of the longest arithmetic sequence (continuou
prime_numbers
- This calculates the prime numbers
1-2
- 计算并列举出N以内的所有素数-And outlines the calculation of all prime numbers less than N. . . . . . . . . . . . . . .
PrimeNumber
- 判断一个数是否为素数。可以作为分析研究素数编程的人参考。-To determine whether a number is prime. Analysis of prime numbers can be used as programming easy reference
flowcontrol
- 流程控制学习程序，包括多层嵌套的IF-ELSE语句实例、正整数分解质因数、判断素数等-Process control learning process, including multiple nested IF-ELSE statements instance, a positive integer prime factor decomposition to determine prime numbers, etc.
cyuanyan
- 判断101-200之间有多少个素数，并输出所有素数。 -Between 101-200 to determine the number of primes, and the output of all prime numbers.
PrimeGeneration
- PRIME NUMBERS CALCULATOR FOR DELPHI
RSA
- 可随机产生素数，对输入的明文进行加密，病对密文解密还原为明文-Can be randomly generated prime numbers, the input plaintext is encrypted, the sick of the ciphertext is decrypted to restore the plaintext
2
- 编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime